Non-ambiguous trees: New results and generalisation
نویسندگان
چکیده
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. thus get differential equation whose solution can be described combinatorially. This yields formula for the number NATs. also obtain q-versions our formula. finally generalise NATs to higher dimension.
منابع مشابه
Combinatorics of non - ambiguous trees † ‡
This article investigates combinatorial properties of non-ambiguous trees. These objects we define may be seen either as binary trees drawn on a grid with some constraints, or as a subset of the tree-like tableaux previously defined by Aval, Boussicault and Nadeau. The enumeration of non-ambiguous trees satisfying some additional constraints allows us to give elegant combinatorial proofs of ide...
متن کاملNeuropsychology of Aesthetic Judgment of Ambiguous and Non-Ambiguous Artworks
Several affective and cognitive processes have been found to be pivotal in affecting aesthetic experience of artworks and both neuropsychological as well as psychiatric symptoms have been found to affect artistic production. However, there is a paucity of studies directly investigating effects of brain lesions on aesthetic judgment. Here, we assessed the effects of unilateral brain damage on ae...
متن کاملAmbiguous POMDPs: Structural Results and Applications
Markov Decision Processes (MDPs) and their generalization, Partially Observable MDPs (POMDPs), have been widely studied and used as invaluable tools in dynamic stochastic decision-making. However, two major barriers have limited their application for problems arising in various practical settings: (a) computational challenges for problems with large state or action spaces, and (b) ambiguity in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2021
ISSN: ['1095-9971', '0195-6698']
DOI: https://doi.org/10.1016/j.ejc.2021.103331